#include <algorithm>
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <ctime>
#include <cstring>
#include <string>
#include <vector>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <deque>
using namespace std;
const int MAX = 10010;
int N, c = 0;
void Hanoi(int n, char x, char y, char z)
{
if(n == 1)
{
printf("%2d. Move disk %d from %c to %c\n", ++c, n, x, z);
}
else
{
Hanoi(n-1, x, z, y);
printf("%2d. Move disk %d from %c to %c\n", ++c, n, x, z);
Hanoi(n-1, y, x, z);
}
}
int main()
{
while(scanf("%d", &N) != EOF)
{
c = 0;
Hanoi(N, 'X', 'Y', 'Z');
printf("\n");
}
return 0;
}
【codeup墓地】1744: 算法3-5:n阶Hanoi塔问题(递归写法)
最新推荐文章于 2020-05-07 16:30:50 发布